Factorization of Motions
نویسنده
چکیده
We define motion polynomials as polynomials with coefficients in the dual quaternions and study their factorizations. The motion polynomials correspond to motions in 3D space, and factoring into linear factors means to compose the motion into translations and rotations. This allows to realize the motion by a linkage with revolute or prismatic joints. This is joint work with G. Hegedüs (Univ. Oboda), Z. Li (RICAM), and H.-P. Schröcker (Univ. Innsbruck). The results are published in [1]. This research has been supported by the Austrian Science Fund (FWF): DKW1214N15. LetH = 〈1, i, j,k〉R be the skew field of quaternions. It is well known [2] thatH is algebraically closed, in the sense that every univariate left polynomial P ∈ H[t] can be written as a product of linear polynomials. Here, the variable t is supposed to commute with the coefficients. To decompose P , one looks for right zeroes in H: if P(q) = 0, then (t −q) is a right factor of P , and the polynomial quotient has degree one less. In order to find right zeroes, we compute the norm polynomial N (t) = P(t)P(t), where P is obtained by conjugating all coefficients. It is a real polynomial that does not assume negative values when evaluated at real numbers. Generically, it has no real zeroes, so that it can be written as a product of irreducible quadratic factors. For any such factor Q, there is a unique common right zero of P and Q in H, and this common right zero can be computed by polynomial division: the polynomial remainder of P mod Q is linear. The factorization algorithm can be extended to skew ring DH = 〈1, i, j,k〉D of dual quaternions, where D = R ⊕ R is the two-dimensional R-algebra generated by R and with 2 = 0. We are especially interested in polynomials with real
منابع مشابه
Factorization of Rational Motions: A Survey with Examples and Applications
Since its introduction in 2012, the factorization theory for rational motions quickly evolved and found applications in theoretical and applied mechanism science. We provide an accessible introduction to motion factorization with many examples, summarize recent developments and hint at some new applications. In particular, we provide pseudo-code for the generic factorization algorithm, demonstr...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کامل$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کاملFactorisation of Rational Motions: A Survey with Examples and Applications
Since its introduction in 2012, the factorization theory for rational motions quickly evolved and found applications in theoretical and applied mechanism science. We provide an accessible introduction to motion factorization with many examples, summarize recent developments and hint at some new applications. In particular, we provide pseudo-code for the generic factorization algorithm, demonstr...
متن کاملOn semi weak factorization structures
In this article the notions of semi weak orthogonality and semi weak factorization structure in a category $mathcal X$ are introduced. Then the relationship between semi weak factorization structures and quasi right (left) and weak factorization structures is given. The main result is a characterization of semi weak orthogonality, factorization of morphisms, and semi weak factorization structur...
متن کامل3D rigid structure from video: what are "easy" shapes and "good" motions?
Factorization algorithms are increasingly popular to recover 3D rigid structure from video. In this paper, we analyze the rank 1 factorization algorithm to determine what are the most suitable 3D shapes or the best 3D motions to recover the 3D structure from the 2D trajectories of the features. We show that the shape is best retrieved from orthogonal views aligned with the longest and smallest ...
متن کامل